Method and apparatus for video coding

ABSTRACT

According to an aspect of the disclosure, a method of video decoding is performed in a video decoder. In the method, coded information of a current block is received from a coded video bitstream. The coded information includes prediction information of the current block. A determination is made whether the current block is predicted using a neighboring reconstructed sample from a non-zero reference line based on the coded information. A primary transform type is determined based on the determination that the current block is predicted using the neighboring reconstructed sample from the non-zero reference line. A primary transform is performed for a transform block that is partitioned from the current block in accordance with the determined primary transform type.

INCORPORATION BY REFERENCE

This present disclosure claims the benefit of priority to U.S. Provisional Application No. 62/851,504, “TRANSFORM SCHEME FOR NON-ZERO REFERENCE LINES” filed on May 22, 2019, which is incorporated by reference be rein in its entirety.

TECHNICAL FIELD

The present disclosure describes embodiments generally related to video coding.

BACKGROUND

The background description provided be rein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.

Video coding and decoding can be performed using inter-picture prediction with motion compensation. Uncompressed digital video can include a series of pictures, each picture having a spatial dimension of, for example, 1920×1080 luminance samples and associated chrominance samples. The series of pictures can have a fixed or variable picture rate (informally also known as frame rate), of, for example 60 pictures per second or 60 Hz. Uncompressed video has specific bitrate requirements. For example, 11080p60 4:2:0 video at 8 bit per sample (1920×1080 luminance sample resolution at 60 Hz frame rate) requires close to 1.5 Gbit/s bandwidth. An hour of such video requires more than 600 GBytes of storage space.

One purpose of video coding and decoding can be the reduction of redundancy in the input video signal, through compression. Compression can help reduce the aforementioned bandwidth and/or storage space requirements, in some cases by two orders of magnitude or more. Both lossless compression and lossy compression, as well as a combination thereof can be employed. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal. When using lossy compression, the reconstructed signal may not be identical to the original signal, but the distortion between original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. In the case of video, lossy compression is widely employed. The amount of distortion tolerated depends on the application; for example, users of certain consumer streaming applications may tolerate higher distortion than users of television distribution applications. The compression ratio achievable can reflect that: higher allowable/tolerable distortion can yield higher compression ratios.

A video encoder and decoder can utilize techniques from several broad categories, including, for example, motion compensation, transform, quantization, and entropy coding.

Video codec technologies can include techniques known as intra coding. In intra coding, sample values are represented without reference to samples or other data from previously reconstructed reference pictures. In some video codecs, the picture is spatially subdivided into blocks of samples. When all blocks of samples are coded in intra mode, that picture can be an intra picture. Intra pictures and their derivations such as independent decoder refresh pictures, can be used to reset the decoder state and can, therefore, be used as the first picture in a coded video bitstream and a video session, or as a still image. The samples of an intra block can be exposed to a transform, and the transform coefficients can be quantized before entropy coding. Intra prediction can be a technique that minimizes sample values in the pre-transform domain. In some cases, the smaller the DC value after a transform is, and the smaller the AC coefficients are, the fewer the bits that are required at a given quantization step size to represent the block after entropy coding.

Traditional intra coding such as known from, for example MPEG-2 generation coding technologies, does not use intra prediction. However, some newer video compression technologies include techniques that attempt, from, for example, surrounding sample data and/or metadata obtained during the encoding/decoding of spatially neighboring, and preceding in decoding order, blocks of data. Such techniques are be henceforth called “intra prediction” techniques. Note that in at least some cases, intra prediction is using reference data only from the current picture under reconstruction and not from reference pictures.

There can be many different forms of intra prediction. When more than one of such techniques can be used in a given video coding technology, the technique in use can be coded in an intra prediction mode. In certain cases, modes can have submodes and/or parameters, and those can be coded individually or included in the mode codeword. Which codeword to use for a given mode/submodel/parameter combination can have an impact in the coding efficiency gain through intra prediction, and so can the entropy coding technology used to translate the codewords into a bitstream.

A certain mode of intra prediction was introduced with H.264, refined in H.265, and further refined in newer coding technologies such as joint exploration model (JEM), versatile video coding (VVC), and benchmark set (BMS). A predictor block can be formed using neighboring sample values belonging to already available samples. Sample values of neighboring samples are copied into the predictor block according to a direction. A reference to the direction in use can be coded in the bitstream or may itself be predicted.

Referring to FIG. 1, depicted in the lower right is a subset of nine predictor directions known from H.265's 33 possible predictor directions (corresponding to the 33 angular modes of the 35 intra modes). The point where the arrows converge (101) represents the sample being predicted. The arrows represent the direction from which the sample is being predicted. For example, arrow (102) indicates that sample (101) is predicted from a sample or samples to the upper right, at a 45 degree angle from the horizontal. Similarly, arrow (103) indicates that sample (101) is predicted from a sample or samples to the lower left of sample (101), in a 22.5 degree angle from the horizontal.

Still referring to FIG. 1, on the top left there is depicted a square block (104) of 4×4 samples (indicated by a dashed, boldface line). The square block (104) includes 16 samples, each labelled with an “S”, its position in the Y dimension (e.g., row index) and its position in the X dimension (e.g., column index). For example, sample S21 is the second sample in the Y dimension (from the top) and the first (from the left) sample in the X dimension. Similarly, sample S44 is the fourth sample in block (104) in both the Y and X dimensions. As the block is 4×4 samples in size, S44 is at the bottom right. Further shown are reference samples that follow a similar numbering scheme. A reference sample is labelled with an R, its Y position (e.g., row index) and X position (column index) relative to block (104). In both H.264 and H.265, prediction samples neighbor the block under reconstruction; therefore no negative values need to be used.

Intra picture prediction can work by copying reference sample values from the neighboring samples as appropriated by the signaled prediction direction. For example, assume the coded video bitstream includes signaling that, for this block, indicates a prediction direction consistent with arrow (102)—that is, samples are predicted from a prediction sample or samples to the upper right, at a 45 degree angle from the horizontal. In that case, samples S41, S32, S23, and S14 are predicted from the same reference sample R05. Sample S44 is then predicted from reference sample R08.

In certain cases, the values of multiple reference samples may be combined, for example through interpolation, in order to calculate a reference sample; especially when the directions are not evenly divisible by 45 degrees.

The number of possible directions has increased as video coding technology has developed. In H.264 (year 2003), nine different direction could be represented. That increased to 33 in H.265 (year 2013), and JEM/VVC/BMS, at the time of disclosure, can support up to 65 directions. Experiments have been conducted to identify the most likely directions, and certain techniques in the entropy coding are used to represent those likely directions in a small number of bits, accepting a certain penalty for less likely directions. Further, the directions themselves can sometimes be predicted from neighboring directions used in neighboring, already decoded, blocks.

FIG. 2 shows a schematic (201) that depicts 65 intra prediction directions according to JEM to illustrate the increasing number of prediction directions over time.

The mapping of intra prediction directions bits in the coded video bitstream that represent the direction can be different from video coding technology to video coding technology; and can range, for example, from simple direct mappings of prediction direction to intra prediction mode, to codewords, to complex adaptive schemes involving most probable modes, and similar techniques. In all cases, however, there can be certain directions that are statistically less likely to occur in video content than certain other directions. As the goal of video compression is the reduction of redundancy, those less likely directions will, in a well working video coding technology, be represented by a larger number of bits than more likely directions.

SUMMARY

Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. In some examples, an apparatus for video decoding includes receiving circuitry and processing circuitry.

According to an aspect of the disclosure, a method of video decoding is performed in a video decoder. In the method, coded information of a current block is received from a coded video bitstream. The coded information includes prediction information of the current block. A determination is made whether the current block is predicted using a neighboring reconstructed sample from a non-zero reference line based on the coded information. A primary transform type is determined based on the determination that the current block is predicted using the neighboring reconstructed sample from the non-zero reference line. A primary transform is performed for a transform block that is partitioned from the current block in accordance with the determined primary transform type.

In some embodiments, the current block can be predicted using the neighboring reconstructed sample from the non-zero reference line, and the primary transform type can be a DCT-2 mode or a skip mode.

In some embodiments, the prediction information can include primary transform type information. The primary transform type can be determined based on the primary transform type information. The primary transform type can be determined to be the skip mode, responsive to the primary transform type information indicating a first value, and the primary transform type can be determined to be the DCT-2 mode, responsive to the primary transform type information indicating a second value.

In some embodiments, a context model can be determined from a set of context models based on the coded information, where the coded information indicates a reference line that includes the neighboring reconstructed sample. Primary transform type information can be decoded based on the determined context model, where the primary transform type information indicates whether the primary transform type is the skip mode or the DCT-2 mode.

In some embodiments, the current block can be predicted using the neighboring reconstructed sample from the non-zero reference line. The primary transform type further can include a horizontal transform type and a vertical transform type. The horizontal transform type can be a DCT-2 mode or a DST-7 mode, and the vertical transform type can be the DCT-2 mode or the DST-7 mode.

In some embodiments, the horizontal transform type and/or the vertical transform type can be dependent on a width or a height of the current block.

In some embodiments, the current block can be predicted using the neighboring reconstructed sample from the non-zero reference line. The non-zero reference line can be a reference line 1 or a reference line 3. The primary transform type can be a DST-7 mode, responsive to the non-zero reference line being the reference line 1. The primary transform type can be a DCT-2 mode, responsive to the non-zero reference line being the reference line 3.

In some embodiments, secondary transform information can be received. The secondary transform information indicates whether a secondary transformation is performed on the transform block. The secondary transformation can be performed on the transform block, responsive to (i) the secondary transform information indicating that the secondary transformation is performed on the transform block, and (ii) the current block being predicted using a neighboring reconstructed sample from a zero reference line (or a reference line zero).

In some embodiments, a context model can be determined from a set of context models based on the coded information, where the coded information indicates a reference line that includes the neighboring reconstructed sample. Secondary transform information can be decoded based on the determined context model, where the secondary transform information indicates whether a secondary transformation is performed on the transform block. The secondary transformation can be performed on the transform block responsive to the secondary transform information indicating the secondary transformation is performed on the transform block.

In some embodiments, secondary transform information can be received, where the secondary transform information indicates whether a secondary transformation is performed on the transform block. The secondary transformation can be performed on the transform block, responsive to (i) the secondary transform information indicating that the secondary transformation is performed on the transform block, and (ii) the current block being predicted using the neighboring reconstructed sample from the non-zero reference line, and (iii) a width and/or a height of the current block is equal to or larger than a threshold.

Aspects of the disclosure also provide a non-transitory computer-readable medium storing instructions which when executed by a computer for video decoding cause the computer to perform the method for video decoding.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which:

FIG. 1 is a schematic illustration of an exemplary subset of intra prediction modes.

FIG. 2 is an illustration of exemplary intra prediction directions.

FIG. 3 is a schematic illustration of a simplified block diagram of a communication system (300) in accordance with an embodiment.

FIG. 4 is a schematic illustration of a simplified block diagram of a communication system (400) in accordance with an embodiment.

FIG. 5 is a schematic illustration of a simplified block diagram of a decoder in accordance with an embodiment.

FIG. 6 is a schematic illustration of a simplified block diagram of an encoder in accordance with an embodiment.

FIG. 7 shows a block diagram of an encoder in accordance with another embodiment.

FIG. 8 shows a block diagram of a decoder in accordance with another embodiment.

FIG. 9 shows 35 intra prediction modes in accordance with an embodiment.

FIG. 10 shows 95 intra prediction modes in accordance with an embodiment.

FIG. 11 shows reference lines adjacent to a coding block unit in accordance with an embodiment.

FIG. 12 shows a first exemplary division of blocks.

FIG. 13 shows a second exemplary division of blocks.

FIG. 14 shows an exemplary reduced secondary transform (RST).

FIG. 15A shows a forward reduced transform.

FIG. 15B shows an inverse reduced transform.

FIG. 16A shows a first exemplary embodiment of RST.

FIG. 16B shows a second exemplary embodiment of RST.

FIG. 17 shows a flow chart outlining a process example according to some embodiments of the disclosure.

FIG. 18 is a schematic illustration of a computer system in accordance with an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

FIG. 3 illustrates a simplified block diagram of a communication system (300) according to an embodiment of the present disclosure. The communication system (300) includes a plurality of terminal devices that can communicate with each other, via, for example, a network (350). For example, the communication system (300) includes a first pair of terminal devices (310) and (320) interconnected via the network (350). In the FIG. 3 example, the first pair of terminal devices (310) and (320) performs unidirectional transmission of data. For example, the terminal device (310) may code video data (e.g., a stream of video pictures that are captured by the terminal device (310)) for transmission to the other terminal device (320) via the network (350). The encoded video data can be transmitted in the form of one or more coded video bitstreams. The terminal device (320) may receive the coded video data from the network (350), decode the coded video data to recover the video pictures and display video pictures according to the recovered video data. Unidirectional data transmission may be common in media serving applications and the like.

In another example, the communication system (300) includes a second pair of terminal devices (330) and (340) that performs bidirectional transmission of coded video data that may occur, for example, during videoconferencing. For bidirectional transmission of data, in an example, each terminal device of the terminal devices (330) and (340) may code video data (e.g., a stream of video pictures that are captured by the terminal device) for transmission to the other terminal device of the terminal devices (330) and (340) via the network (350). Each terminal device of the terminal devices (330) and (340) also may receive the coded video data transmitted by the other terminal device of the terminal devices (330) and (340), and may decode the coded video data to recover the video pictures and may display video pictures at an accessible display device according to the recovered video data.

In the FIG. 3 example, the terminal devices (310), (320), (330) and (340) may be illustrated as servers, personal computers and smart phones but the principles of the present disclosure may be not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players and/or dedicated video conferencing equipment. The network (350) represents any number of networks that convey coded video data among the terminal devices (310), (320), (330) and (340), including for example wireline (wired) and/or wireless communication networks. The communication network (350) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network (350) may be immaterial to the operation of the present disclosure unless explained be rein below.

FIG. 4 illustrates, as an example for an application for the disclosed subject matter, the placement of a video encoder and a video decoder in a streaming environment. The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on.

A streaming system may include a capture subsystem (413), that can include a video source (401), for example a digital camera, creating for example a stream of video pictures (402) that are uncompressed. In an example, the stream of video pictures (402) includes samples that are taken by the digital camera. The stream of video pictures (402), depicted as a bold line to emphasize a high data volume when compared to encoded video data (404) (or coded video bitstreams), can be processed by an electronic device (420) that includes a video encoder (403) coupled to the video source (401). The video encoder (403) can include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video data (404) (or encoded video bitstream (404)), depicted as a thin line to emphasize the lower data volume when compared to the stream of video pictures (402), can be stored on a streaming server (405) for future use. One or more streaming client subsystems, such as client subsystems (406) and (408) in FIG. 4 can access the streaming server (405) to retrieve copies (407) and (409) of the encoded video data (404). A client subsystem (406) can include a video decoder (410), for example, in an electronic device (430). The video decoder (410) decodes the incoming copy (407) of the encoded video data and creates an outgoing stream of video pictures (411) that can be rendered on a display (412) (e.g., display screen) or other rendering device (not depicted). In some streaming systems, the encoded video data (404), (407), and (409) (e.g., video bitstreams) can be encoded according to certain video coding/compression standards. Examples of those standards include ITU-T Recommendation H.265. In an example, a video coding standard under development is informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC.

It is noted that the electronic devices (420) and (430) can include other components (not shown). For example, the electronic device (420) can include a video decoder (not shown) and the electronic device (430) can include a video encoder (not shown) as well.

FIG. 5 shows a block diagram of a video decoder (510) according to an embodiment of the present disclosure. The video decoder (510) can be included in an electronic device (530). The electronic device (530) can include a receiver (531) (e.g., receiving circuitry). The video decoder (510) can be used in the place of the video decoder (410) in the FIG. 4 example.

The receiver (531) may receive one or more coded video sequences to be decoded by the video decoder (510); in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel (501), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver (531) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver (531) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory (515) may be coupled in between the receiver (531) and an entropy decoder/parser (520) (“parser (520)” henceforth). In certain applications, the buffer memory (515) is part of the video decoder (510). In others, it can be outside of the video decoder (510) (not depicted). In still others, there can be a buffer memory (not depicted) outside of the video decoder (510), for example to combat network jitter, and in addition another buffer memory (515) inside the video decoder (510), for example to handle playout timing. When the receiver (531) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (515) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer memory (515) may be required, can be comparatively large and can be advantageously of adaptive size, and may at least partially be implemented in an operating system or similar elements (not depicted) outside of the video decoder (510).

The video decoder (510) may include the parser (520) to reconstruct symbols (521) from the coded video sequence. Categories of those symbols include information used to manage operation of the video decoder (510), and potentially information to control a rendering device such as a render device (512) (e.g., a display screen) that is not an integral part of the electronic device (530) but can be coupled to the electronic device (530), as was shown in FIG. 5. The control information for the rendering device(s) may be in the form of Supplemental Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser (520) may parse/entropy-decode the coded video sequence that is received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser (520) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameter corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The parser (520) may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, motion vectors, and so forth.

The parser (520) may perform an entropy decoding/parsing operation on the video sequence received from the buffer memory (515), so as to create symbols (521).

Reconstruction of the symbols (521) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser (520). The flow of such subgroup control information between the parser (520) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, the video decoder (510) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (551). The scaler/inverse transform unit (551) receives a quantized transform coefficient as well as control information, including which transform to use, block size, quantization factor, quantization scaling matrices, etc. as symbol(s) (521) from the parser (520). The scaler/inverse transform unit (551) can output blocks comprising sample values, that can be input into aggregator (555).

In some cases, the output samples of the scaler/inverse transform (551) can pertain to an intra coded block; that is: a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit (552). In some cases, the intra picture prediction unit (552) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current picture buffer (558). The current picture buffer (558) buffers, for example, partly reconstructed current picture and/or fully reconstructed current picture. The aggregator (555), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit (552) has generated to the output sample information as provided by the scaler/inverse transform unit (551).

In other cases, the output samples of the scaler/inverse transform unit (551) can pertain to an inter coded, and potentially motion compensated block. In such a case, a motion compensation prediction unit (553) can access reference picture memory (557) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols (521) pertaining to the block, these samples can be added by the aggregator (555) to the output of the scaler/inverse transform unit (551) (in this case called the residual samples or residual signal) so as to generate output sample information. The addresses within the reference picture memory (557) from where the motion compensation prediction unit (553) fetches prediction samples can be controlled by motion vectors, available to the motion compensation prediction unit (553) in the form of symbols (521) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory (557) when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (555) can be subject to various loop filtering techniques in the loop filter unit (556). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video sequence (also referred to as coded video bitstream) and made available to the loop filter unit (556) as symbols (521) from the parser (520), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values.

The output of the loop filter unit (556) can be a sample stream that can be output to the render device (512) as well as stored in the reference picture memory (557) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, the parser (520)), the current picture buffer (558) can become a part of the reference picture memory (557), and a fresh current picture buffer can be reallocated before commencing the reconstruction of the following coded picture.

The video decoder (510) may perform decoding operations according to a predetermined video compression technology in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that the coded video sequence adheres to both the syntax of the video compression technology or standard and the profiles as documented in the video compression technology or standard. Specifically, a profile can select certain tools as the only tools available for use under that profile from all the tools available in the video compression technology or standard. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

In an embodiment, the receiver (531) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). The additional data may be used by the video decoder (510) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on.

FIG. 6 shows a block diagram of a video encoder (603) according to an embodiment of the present disclosure. The video encoder (603) is included in an electronic device (620). The electronic device (620) includes a transmitter (640) (e.g., transmitting circuitry). The video encoder (603) can be used in the place of the video encoder (403) in the FIG. 4 example.

The video encoder (603) may receive video samples from a video source (601) (that is not part of the electronic device (620) in the FIG. 6 example) that may capture video image(s) to be coded by the video encoder (603). In another example, the video source (601) is a part of the electronic device (620).

The video source (601) may provide the source video sequence to be coded by the video encoder (603) in the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ), and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCh 4:4:4). In a media serving system, the video source (601) may be a storage device storing previously prepared video. In a videoconferencing system, the video source (601) may be a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focuses on samples.

According to an embodiment, the video encoder (603) may code and compress the pictures of the source video sequence into a coded video sequence (643) in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of a controller (650). In some embodiments, the controller (650) controls other functional units as described below and is functionally coupled to the other functional units. The coupling is not depicted for clarity. Parameters set by the controller (650) can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimization techniques, . . . ), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth. The controller (650) can be configured to have other suitable functions that pertain to the video encoder (603) optimized for a certain system design.

In some embodiments, the video encoder (603) is configured to operate in a coding loop. As an oversimplified description, in an example, the coding loop can include a source coder (630) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded, and a reference picture(s)), and a (local) decoder (633) embedded in the video encoder (603). The decoder (633) reconstructs the symbols to create the sample data in a similar manner as a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to the reference picture memory (634). As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote), the content in the reference picture memory (634) is also bit exact between the local encoder and remote encoder. In other words, the prediction part of an encoder “sees” as reference picture samples exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example because of channel errors) is used in some related arts as well.

The operation of the “local” decoder (633) can be the same as of a “remote” decoder, such as the video decoder (510), which has already been described in detail above in conjunction with FIG. 5. Briefly referring also to FIG. 5, however, as symbols are available and encoding/decoding of symbols to a coded video sequence by an entropy coder (645) and the parser (520) can be lossless, the entropy decoding parts of the video decoder (510), including the buffer memory (515), and parser (520) may not be fully implemented in the local decoder (633).

An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to be present, in substantially identical functional form, in a corresponding encoder. For this reason, the disclosed subject matter focuses on decoder operation. The description of encoder technologies can be abbreviated as they are the inverse of the comprehensively described decoder technologies. Only in certain areas a more detail description is required and provided below.

During operation, in some examples, the source coder (630) may perform motion compensated predictive coding, which codes an input picture predictively with reference to one or more previously coded picture from the video sequence that were designated as “reference pictures.” In this manner, the coding engine (632) codes differences between pixel blocks of an input picture and pixel blocks of reference picture(s) that may be selected as prediction reference(s) to the input picture.

The local video decoder (633) may decode coded video data of pictures that may be designated as reference pictures, based on symbols created by the source coder (630). Operations of the coding engine (632) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in FIG. 6), the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder (633) replicates decoding processes that may be performed by the video decoder on reference pictures and may cause reconstructed reference pictures to be stored in the reference picture cache (634). In this manner, the video encoder (603) may store copies of reconstructed reference pictures locally that have common content as the reconstructed reference pictures that will be obtained by a far-end video decoder (absent transmission errors).

The predictor (635) may perform prediction searches for the coding engine (632). That is, for a new picture to be coded, the predictor (635) may search the reference picture memory (634) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor (635) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor (635), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory (634).

The controller (650) may manage coding operations of the source coder (630), including, for example, setting of parameters and subgroup parameters used for encoding the video data.

Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder (645). The entropy coder (645) translates the symbols as generated by the various functional units into a coded video sequence, by lossless compressing the symbols according to technologies such as Huffman coding, variable length coding, arithmetic coding, and so forth.

The transmitter (640) may buffer the coded video sequence(s) as created by the entropy coder (645) to prepare for transmission via a communication channel (660), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter (640) may merge coded video data from the video coder (603) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown).

The controller (650) may manage operation of the video encoder (603). During coding, the controller (650) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be applied to the respective picture. For example, pictures often may be assigned as one of the following picture types:

An Intra Picture (I picture) may be one that may be coded and decoded without using any other picture in the sequence as a source of prediction. Some video codecs allow for different types of intra pictures, including, for example Independent Decoder Refresh (“IDR”) Pictures. A person skilled in the art s aware of those variants of I pictures and their respective applications and features.

A predictive picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block.

A bi-directionally predictive picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks' respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of B pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.

The video encoder (603) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265. In its operation, the video encoder (603) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used.

In an embodiment, the transmitter (640) may transmit additional data with the encoded video. The source coder (630) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, and so on.

A video may be captured as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated to intra prediction) makes use of spatial correlation in a given picture, and inter-picture prediction makes uses of the (temporal or other) correlation between the pictures. In an example, a specific picture under encoding/decoding, which is referred to as a current picture, is partitioned into blocks. When a block in the current picture is similar to a reference block in a previously coded and still buffered reference picture in the video, the block in the current picture can be coded by a vector that is referred to as a motion vector. The motion vector points to the reference block in the reference picture, and can have a third dimension identifying the reference picture, in case multiple reference pictures are in use.

In some embodiments, a bi-prediction technique can be used in the inter-picture prediction. According to the bi-prediction technique, two reference pictures, such as a first reference picture and a second reference picture that are both prior in decoding order to the current picture in the video (but may be in the past and future, respectively, in display order) are used. A block in the current picture can be coded by a first motion vector that points to a first reference block in the first reference picture, and a second motion vector that points to a second reference block in the second reference picture. The block can be predicted by a combination of the first reference block and the second reference block.

Further, a merge mode technique can be used in the inter-picture prediction to improve coding efficiency.

According to some embodiments of the disclosure, predictions, such as inter-picture predictions and intra-picture predictions are performed in the unit of blocks. For example, according to the HEVC standard, a picture in a sequence of video pictures is partitioned into coding tree units (CTU) for compression, the CTUs in a picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are one lama CTB and two chroma CTBs. Each CTU can be recursively quadtree split into one or multiple coding units (CUs). For example, a CTU of 64×64 pixels can be split into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In an example, each CU is analyzed to determine a prediction type for the CU, such as an inter prediction type or an intra prediction type. The CU is split into one or more prediction units (PUs) depending on the temporal and/or spatial predictability. Generally, each PU includes a luma prediction block (PB), and two chroma PBs. In an embodiment, a prediction operation in coding (encoding/decoding) is performed in the unit of a prediction block. Using a luma prediction block as an example of a prediction block, the prediction block includes a matrix of values (e.g., luma values) for pixels, such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

FIG. 7 shows a diagram of a video encoder (703) according to another embodiment of the disclosure. The video encoder (703) is configured to receive a processing block (e.g., a prediction block) of sample values within a current video picture in a sequence of video pictures, and encode the processing block into a coded picture that is part of a coded video sequence. In an example, the video encoder (703) is used in the place of the video encoder (403) in the FIG. 4 example.

In an HEVC example, the video encoder (703) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples, and the like. The video encoder (703) determines whether the processing block is best coded using intra mode, inter mode, or hi-prediction mode using, for example, rate-distortion optimization. When the processing block is to be coded in intra mode, the video encoder (703) may use an intra prediction technique to encode the processing block into the coded picture; and when the processing block is to be coded in inter mode or bi-prediction mode, the video encoder (703) may use an inter prediction or bi-prediction technique, respectively, to encode the processing block into the coded picture. In certain video coding technologies, merge mode can be an inter picture prediction submode where the motion vector is derived from one or more motion vector predictors without the benefit of a coded motion vector component outside the predictors. In certain other video coding technologies, a motion vector component applicable to the subject block may be present. In an example, the video encoder (703) includes other components, such as a mode decision module (not shown) to determine the mode of the processing blocks.

In the FIG. 7 example, the video encoder (703) includes the inter encoder (730), an intra encoder (722), a residue calculator (723), a switch (726), a residue encoder (724), a general controller (721), and an entropy encoder (725) coupled together as shown in FIG. 7.

The inter encoder (730) is configured to receive the samples of the current block (e.g., a processing block), compare the block to one or more reference blocks in reference pictures (e.g., blocks in previous pictures and later pictures), generate inter prediction information (e.g., description of redundant information according to inter encoding technique, motion vectors, merge mode information), and calculate inter prediction results (e.g., predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference pictures are decoded reference pictures that are decoded based on the encoded video information.

The intra encoder (722) is configured to receive the samples of the current block (e.g., a processing block), in some cases compare the block to blocks already coded in the same picture, generate quantized coefficients after transform, and in some cases also intra prediction information (e.g., an intra prediction direction information according to one or more intra encoding techniques). In an example, the intra encoder (722) also calculates intra prediction results (e.g., predicted block) based on the intra prediction information and reference blocks in the same picture.

The general controller (721) is configured to determine general control data and control other components of the video encoder (703) based on the general control data. In an example, the general controller (721) determines the mode of the block, and provides a control signal to the switch (726) based on the mode. For example, when the mode is the intra mode, the general controller (721) controls the switch (726) to select the intra mode result for use by the residue calculator (723), and controls the entropy encoder (725) to select the intra prediction information and include the intra prediction information in the bitstream; and when the mode is the inter mode, the general controller (721) controls the switch (726) to select the inter prediction result for use by the residue calculator (723), and controls the entropy encoder (725) to select the inter prediction information and include the inter prediction information in the bitstream.

The residue calculator (723) is configured to calculate a difference (residue data) between the received block and prediction results selected from the intra encoder (722) or the inter encoder (730). The residue encoder (724) is configured to operate based on the residue data to encode the residue data to generate the transform coefficients. In an example, the residue encoder (724) is configured to convert the residue data from a spatial domain to a frequency domain, and generate the transform coefficients. The transform coefficients are then subject to quantization processing to obtain quantized transform coefficients. In various embodiments, the video encoder (703) also includes a residue decoder (728). The residue decoder (728) is configured to perform inverse-transform, and generate the decoded residue data. The decoded residue data can be suitably used by the intra encoder (722) and the inter encoder (730). For example, the inter encoder (730) can generate decoded blocks based on the decoded residue data and inter prediction information, and the intra encoder (722) can generate decoded blocks based on the decoded residue data and the intra prediction information. The decoded blocks are suitably processed to generate decoded pictures and the decoded pictures can be buffered in a memory circuit (not shown) and used as reference pictures in some examples.

The entropy encoder (725) is configured to format the bitstream to include the encoded block. The entropy encoder (725) is configured to include various information according to a suitable standard, such as the HEVC standard. In an example, the entropy encoder (725) is configured to include the general control data, the selected prediction information (e.g., intra prediction information or inter prediction information), the residue information, and other suitable information in the bitstream. Note that, according to the disclosed subject matter, when coding a block in the merge submode of either inter mode or bi-prediction mode, there is no residue information.

FIG. 8 shows a diagram of a video decoder (810) according to another embodiment of the disclosure. The video decoder (810) is configured to receive coded pictures that are part of a coded video sequence, and decode the coded pictures to generate reconstructed pictures. In an example, the video decoder (810) is used in the place of the video decoder (410) in the FIG. 4 example.

In the FIG. 8 example, the video decoder (810) includes an entropy decoder (871), an inter decoder (880), a residue decoder (873), a reconstruction module (874), and an intra decoder (872) coupled together as shown in FIG. 8.

The entropy decoder (871) can be configured to reconstruct, from the coded picture, certain symbols that represent the syntax elements of which the coded picture is made up. Such symbols can include, for example, the mode in which a block is coded (such as, for example, intra mode, inter mode, bi-predicted mode, the latter two in merge submode or another submode), prediction information (such as, for example, intra prediction information or inter prediction information) that can identify certain sample or metadata that is used for prediction by the intra decoder (872) or the inter decoder (880), respectively, residual information in the form of, for example, quantized transform coefficients, and the like. In an example, when the prediction mode is inter or hi-predicted mode, the inter prediction information is provided to the inter decoder (880); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder (872). The residual information can be subject to inverse quantization and is provided to the residue decoder (873).

The inter decoder (880) is configured to receive the inter prediction information, and generate inter prediction results based on the inter prediction information.

The intra decoder (872) is configured to receive the intra prediction information, and generate prediction results based on the intra prediction information.

The residue decoder (873) is configured to perform inverse quantization to extras de-quantized transform coefficients, and process the de-quantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residue decoder (873) may also require certain control information (to include the Quantizer Parameter (QP)), and that information may be provided by the entropy decoder (871) (data path not depicted as this may be low volume control information only).

The reconstruction module (874) is configured to combine, in the spatial domain, the residual as output by the residue decoder (873) and the prediction results (as output by the inter or intra prediction modules as the case may be) to form a reconstructed block, that may be part of the reconstructed picture, which in turn may be part of the reconstructed video. It is noted that other suitable operations, such as a deblocking operation and the like, can be performed to improve the visual quality.

It is noted that the video encoders (403), (603), and (703), and the video decoders (410), (510), and (810) can be implemented using any suitable technique. In an embodiment, the video encoders (403), (603), and (703), and the video decoders (410), (510), and (810) can be implemented using one or more integrated circuits. In another embodiment, the video encoders (403), (603), and (603), and the video decoders (410), (510), and (810) can be implemented using one or more processors that execute software instructions.

The present disclosure is directed to a set of advanced video coding technologies, including a transform scheme for non-zero reference lines.

A total of 35 intra prediction modes is illustrated in FIG. 9, for example as used in HEVC. Among the 35 intra prediction modes, mode 10 is a horizontal mode and mode 26 is a vertical mode. Modes 2, 18, and 34 are diagonal modes. The 35 intra prediction modes can be signalled by three most probable modes (MPMs) and 32 remaining modes.

A total of 95 intra prediction modes is illustrated in FIG. 10, for example as used in VVC. Mode 18 is a horizontal mode and mode 50 is a vertical mode. Modes 2, 34, and 66 are diagonal modes. Modes −1 to −14 and modes 67 to 80 can be referred to as Wide-Angle intra Prediction (WAIP) modes.

In multi-line intra prediction, additional reference lines can be used for intra prediction. An encoder can determine and signal which reference line is used to generate the intra predictor. In one example, reference lines 0, 1, and 3 can be used, and reference line 2 can be excluded. The reference line index can be signaled before intra prediction modes, and only the most probable modes can be allowed in case a nonzero reference line index is signaled. In FIG. 11, an example of 4 reference lines (e.g., reference lines 0-3) is depicted, where each of the four reference lines is composed of six segments, i.e., Segments A to F, together with the top-left reference sample. In addition, the Segments A and F can be padded with the closest samples from the Segments B and E, respectively.

An Intra Sub-Partitions (ISP) coding mode divides lama intra-predicted blocks vertically or horizontally into 2 or 4 sub-partitions depending on the block size dimensions, as shown in Table 1 for example. FIGS. 12 and 13 show two exemplary possibilities. FIG. 12 illustrates an exemplary division that can be applied to 4×8 and 8×4 blocks. FIG. 13 illustrates an exemplary division that can be applied to all blocks except 4×8, 8×4, and 4×4 blocks. It should be noted that all sub-partitions fulfill the condition of having at least 16 samples as an example.

TABLE 1 Number of sub-partitions depending on the block size Block Size Number of Sub-Partitions 4 × 4 Not divided 4 × 8 and 8 × 4 2 All other cases 4

For each sub-partition, a residual signal can be generated by entropy decoding coefficients sent by the encoder. The coefficients are inverse quantized and inverse transformed. A sub-partition can be subsequently intra predicted to generate a prediction signal and corresponding reconstructed samples of the sub-partition can be obtained by adding the residual signal to the prediction signal. Therefore, the reconstructed values of each of the sub-partitions can be available to generate the prediction of a next sub-partition. This process mentioned above can be repeated for the other sub-partitions. In addition, all sub-partitions can share a same intra mode.

Based on the intra mode and the split utilized, two different classes of processing orders can be used, which can be referred to as a normal processing order and a reversed processing order. In the normal processing order, a first sub-partition to be processed is the one containing the top-left sample of the CU and then the normal processing order continues downwards (e.g., for a horizontal split) or rightwards (e.g., for a vertical split). As a result, reference samples used to generate the sub-partition prediction signals can only be located at the left and above sides of the reference lines. On the other hand, the reverse processing order can either start with a sub-partition containing the bottom-left sample of the CU and continues upwards or start with a sub-partition containing the top-right sample of the CU and continues leftwards.

The ISP algorithm is only tested with intra modes that are part of the MPM list in some embodiments. For this reason, if a block uses ISP, the MPM flag can be inferred to be one. In addition, if ISP is used for a certain block, the MPM list can be modified to exclude the DC mode, and to prioritize horizontal intra modes for the ISP horizontal split and vertical infra modes for the vertical split.

Besides 4-point, 8-point, 16-point and 32-point DCT-2 transforms which are applied in HEVC, additional 2-point and 64-point DCT-2 can also be included, in VVC for example. All the primary transform matrices in VVC can be used with 8-bit representation. Adaptive Multiple Transforms (AMT) can be applied to the CUs with both a width and a height smaller than or equal to 32, and whether AMT applies or not to the CUs can be controlled by a flag called mts_flag. For example, when the mts_flag is equal to 0, only DCT-2 is applied for coding the residue. When the mts_flag is equal to 1, an index mts_idx can further be signalled using 2 bins to identify the horizontal and vertical transform to be used according to Table 2, where value 1 means using DST-7 and value 2 means using DCT-8 for example.

When both the height and width of the coding block is smaller than or equal to 64, the transform size can always the same as the coding block size, such as in VVC. When either the height or width of the coding block is larger than 64, during the operation of the transform or intra prediction, the coding block can further be split into multiple sub-blocks, where the width and the height of each sub-block is smaller than or equal to 64, and one transform is performed on each sub-block.

In JVET-M0464, a modified syntax design for transform skip and MTS has been proposed and adopted into VVC Draft 3. The following Table 2 illustrates the modified syntax of the proposed joint syntax element tu_mts_jdx compared to VVC Draft 3.

TABLE 2 a modified syntax including a joint syntax element tu_mts_idx VVC Draft 3 Proposed method in JVET-M0464 transform_unit( ) transform_unit( )  tu_cbf_luma  tu_cbf_luma ...  if( ... tu_cbf_luma &&  if( ... tu_cbf_luma &&   ( tbWidth <= 32 ) &&   ( tbWidth <= 32 ) &&   ( tbHeight <= 32 ) ... )   ( tbHeight <= 32 ) ... )   tu_mts_flag   tu_mts_idx residual_coding( cIdx )  if( ( cIdx ! = 0 | | !tu_mts_flag ) &&   ( log2TbWidth <= 2 ) &&   ( log2TbHeight <= 2 ) )   transform_skip_flag[ cIdx ]  ... /* coefficient parsing */ ...  if( tu_mts_flag && cIdx = = 0 )   mts_idx

In Table 2, mts_idx[x0][y0] specifies which transform kernels are applied to the luma residual samples along the horizontal and vertical direction of the current transform block. The array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered transform block relative to the top-left luma sample of the picture.

In addition, transform_skip_flag[x0][y0][cIdx] specifies whether a transform is applied to the associated transform block or not. The array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered transform block relative to the top-left luma sample of the picture. The array index cIdx specifies an indicator for the color component. The array index cIdx can be equal to 0 for luma, equal to 1 for Cb and equal to 2 for Cr, transform_skip_flag[x0][y0][cIdx] equal to 1 specifies that no transform is applied to the current transform block transform_skip_flag[x0][y0][cIdx] equal to 0 specifies that the decision whether transform is applied to the current transform block or not depends on other syntax elements. When transform_skip_flag[x0][y0][cIdx] j is not present, the transform_skip_flag[x0][y0][cIdx] is inferred to be equal to 0.

Instead of parsing the MTS flag first, then parsing the TS flag, and followed by fixed length coding with 2 bins for the MTS index, the new joint syntax element_tu_mts_idx uses truncated unary binarization. The first bin indicates TS (or transform skip), the second bin indicates MTS and all following bins indicate the MTS index. Examples of the semantics and binarization is shown in Table 3.

TABLE 3 tu_mts_idx using truncated unary binarization transform type binarization MTS & TS MTS TS tu_mts_idx horizontal vertical enabled enabled enabled 0 SKIP SKIP 0 — 0 1 DCT-2 DCT-2 10 0 1 2 DST-7 DST-7 110 10 — 3 DCT-8 DST-7 1110 110 — 4 DST-7 DCT-8 11110 1110 — 5 DCT-8 DCT-8 11111 1111 —

When the number of context models is not changed, the assignment of the context index increment ctxInc to each bin of to mts_idx can be shown in Table 4. As shown in Table 4, the ctxInc can have values that include 0-9, and na, which correspond to values of binIdx (e.g., 0, 1, 2, 3, 4, >=5).

TABLE 4 an assignment of the context index increment ctxInc to each bin of tu_mts_idx binIdx Syntax element 0 1 2 3 4 >=5 tu_mts_idx 0 1 . . . 6 7 8 9 na (MTS & TS) (1 + cqtDepth) tu_mts_idx 1 . . . 6 7 8 9 na na (MTS) (1 + cqtDepth) tu_mts_idx 0 na na na na na (TS)

A mode-dependent non-separable secondary transform (NSST) can be applied between the forward core transform and quantization (e.g., at the encoder) and between the de-quantization and inverse core transform (e.g., at the decoder). To reduce complexity, NSST is only applied to the low frequency coefficients after the primary transform for example. If both a width (W) and a height (H) of a transform coefficient block are larger than or equal to 8, then 8×8 non-separable secondary transform can be applied to the top-left 8×8 region of the transform coefficients block. Otherwise, if either a W or a H of a transform coefficient block is equal to 4, a 4×4 non-separable secondary transform can be applied and the 4×4 non-separable transform is performed on the top-left min(8,W)×min(8,H) region of the transform coefficient block. The above transform selection rule can be applied for both luma and chroma components.

Matrix multiplication implementation of a non-separable transform can be described as follows using a 4×4 input block X as an example. To apply the non-separable transform, the 4×4 input block X

$\begin{matrix} {X = \begin{bmatrix} X_{00} & X_{01} & X_{02} & X_{03} \\ X_{10} & X_{11} & X_{12} & X_{13} \\ X_{20} & X_{21} & X_{22} & X_{23} \\ X_{30} & X_{31} & X_{32} & X_{33} \end{bmatrix}} & \left( {{Eq}.\mspace{11mu} 1} \right) \end{matrix}$

-   is represented as a vector {right arrow over (X)}: -   {right arrow over (X)}=[X₀₀ X₀₁ X₀₂ X₀₃ X₁₀ X₁₁ X₁₂ X₁₃ X₂₀ X₂₁ X₂₂     X₂₃ X₃₀ X₃₁ X₃₂ X₃₃]^(T)

The non-separable transform is calculated as {right arrow over (F)}=T·{right arrow over (X)}, where {right arrow over (F)} indicates the transform coefficient vector, and T is a 16×16 transform matrix. The 16×1 coefficient vector {right arrow over (F)} is subsequently re-organized as a 4×4 block using the scanning order for that block (e.g., horizontal, vertical, or diagonal). The coefficients with a smaller index can be placed with the smaller scanning index in the 4×4 coefficient block. A Hypercube-Givens Transform (HyGT) with a butterfly implementation can be used instead of matrix multiplication to reduce the complexity of non-separable transform, for example in JEM.

In one embodiment, 35×3 non-separable secondary transforms can be utilized in a design of NSST for both 4×4 and 8×8 block sizes, where 35 is the number of transform sets specified by the intra prediction mode, denoted as set, and 3 is the number of NSST candidates for each intra prediction mode. The mapping from the intra prediction mode to the transform set can be defined in Table 5. The transform set applied to luma/chroma transform coefficients is specified by the corresponding luma/chroma intra prediction modes, according to Table 5 for example. For intra prediction modes larger than 34 (e.g., diagonal prediction direction), the transform coefficient block can be transposed before and/or after the secondary transform at the encoder and/or decoder.

For each transform set, the selected non-separable secondary transform candidate can further be specified by the explicitly signalled CU-level NSST index. The index is signalled in a bitstream once per intra CU after transform coefficients and truncated unary binarization is used. The truncated value is 2 in case of planar or DC mode, and 3 for angular intra prediction mode. The CU-level NSST index is signalled only when more than one non-zero coefficient is positioned in a CU. The default value of the CU-level NSST index is zero when the CU-level NSST index is not signalled. A zero value of the CU-level NSST index indicates secondary transform is not applied to the current CU, and other values (e.g., values 1-3) can indicate which secondary transform from the set should be applied.

In some embodiments, NSST may not be applied for a block coded with transform skip mode. When the NSST index is signalled for a CU and not equal to zero, NSST is not used for a block of a component that is coded with transform skip mode in the CU. When a CU with blocks of all components are coded in transform skip mode or the number of non-zero coefficients of non-transform-skip mode CBs is less than 2, the NSST index is not signalled for the CU.

Reduced Size Transform (RST) is a variant of NSST using a transform zero-out scheme, which is also named as Low Frequency Non Separable Transform (LFNST), has been proposed in JVET-N0193. The RST checks whether the intra prediction mode is Planar or DC for entropy coding the transform index of NSST.

In JVET-N0193, for example, four transform sets are applied, and each transform set includes three RST transform cores, which can be either size 16×48 (e.g., applied for a transform coefficient block with a height and a width both being greater than or equal to 8) or 16×16 (e.g., applied for a transform coefficient block with either the height or the width being equal to 4). For rotational convenience, the 16×64 (or 16×48) transform is denoted as RST8×8 and the 16×16 transform is denoted as RST4×4. FIG. 14 shows an exemplary RST8×8 that has a RST using a 16×64 secondary transform core.

For the computation of RST, the main idea of a Reduced Transform (RT) is to map an N dimensional vector to an R dimensional vector in a different space, where R/N (R<N) is the reduction factor. The RT matrix is an R×N matrix as follows:

$\begin{matrix} {T_{RxN} = \begin{bmatrix} t_{11} & t_{12} & t_{13} & \ldots & t_{1N} \\ t_{21} & t_{22} & t_{23} & \ldots & t_{2N} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ t_{R\; 1} & t_{R\; 2} & t_{R\; 3} & \ldots & t_{RN} \end{bmatrix}} & \left( {{Eq}.\mspace{11mu} 2} \right) \end{matrix}$ where the R rows of the transform are R bases of the N dimensional space. The inverse transform matrix for RT is the transpose of its forward transform. The forward and inverse RT can be depicted in FIGS. 15A and 15B. FIG. 15A is a schematic view of a forward reduced transform and FIG. 15B is a schematic view of a reduced inverse transform.

The RST8×8 with a reduction factor of 4 (¼ size) can be applied. Hence, instead of 64×64, which is a conventional 8×8 non-separable transform matrix size, a 16×64 direct matrix can be used. In other words, the 64×16 inverse RST matrix can be used at the decoder side to generate core (primary) transform coefficients in 8×8 top-left regions. The forward RST8×8 uses 16×64 (or 8×64 for 8×8 block) matrices so that the forward RST8×8 produces non-zero coefficients only in the top-left 4×4 region within the given 8×8 region. In other words, if RST is applied then the 8×8 region except its top-left 4×4 region can have only zero coefficients. For RST4×4, 16×16 (or 8×16 for 4×4 block) direct matrix multiplication can be applied.

In addition, for RST8×8, to further reduce the transform matrix size, instead of using the whole top-left 8×8 coefficients as inputs for calculating the secondary transform, the top-left three 4×4 coefficients can be used as the inputs for calculating the secondary transform. FIGS. 16A-16B show different alternatives of RST8×8. FIG. 16A shows an example of 16×64 transform matrices and the whole top-left 8×8 coefficients are applied as inputs for calculating the secondary transform. FIG. 16B shows an example of 16×48 transform matrices and the top-left three 4×4 coefficients are used as the inputs for calculating the secondary transform.

An inverse RST can be conditionally applied when the following two conditions are satisfied: (a) block size is greater than or equal to a given threshold (width>=4 && height>=4); and (b) transform skip mode flag is equal to zero.

If both a width (W) and a height (H) of a transform coefficient block are greater than 4, then the RST8×8 can be applied to the top-left 8×8 region of the transform coefficient block. Otherwise, the RST4×4 can be applied on the top-left min(8, W)×min(8, H) region of the transform coefficient block.

In an embodiment, if a RST index is equal to 0, RST is not applied. Otherwise, RST is applied, and a corresponding kernel (or transform set) is chosen in accordance with the RST index. Furthermore, RST can be applied for an intra CU in both intra and inter slices, and for both Luma and Chroma. If a dual tree is enabled, RST indices for Luma and Chroma can be signaled separately. For inter slice (the dual tree is disabled), a single RST index can be signaled and used for both Luma and Chroma. When ISP mode is selected, RST is disabled and RST index is not signaled.

For the derivation of an RST transform set, an RST matrix can be chosen from four transform sets, and each of the four transform sets can include (or consist of) two transforms. Which transform set is applied can be determined from an intra prediction mode as follows: (a) If one of three Cross-component Linear Model (CCLM) modes is indicated, transform set 0 is selected; (b) Otherwise, transform set selection is performed according to Table 5.

TABLE 5 The transform set selection table Tr. set IntraPredMode index IntraPredMode < 0 1 0 <= IntraPredMode <= 1 0 2 <= IntraPredMode <= 12 1 13 <= IntraPredMode <= 23 2 24 <= IntraPredMode <= 44 3 45 <= IntraPredMode <= 55 2 56 <= IntraPredMode 1

As shown in Table 5, an index IntraPredMode can have a range of [−14, 83], which is a transformed mode index used for wide angle intra prediction. An index Tr. set index can have a group of values that correspond to the range of the index IntraPredMode.

Currently in VTM5.0, a same transform scheme is applied whether or not a current block is predicted by using neighboring reconstructed samples from a zero-reference line or non-zero reference lines. However, a residual energy distribution is different for these two cases. Therefore, it may be not desirable to use the same transform scheme for both two cases.

In the disclosure, the term block may be interpreted as a prediction block, a coding block, or a coding unit (CU). The line index of the nearest reference line is 0 (zero reference line or adjacent reference line), and other lines are called non-zero reference lines (or non-adjacent reference lines).

In the disclosure, different transform schemes can be applied on a current block when the current block is predicted using one or more neighboring reconstructed samples from zero-reference line and non-zero reference lines.

In some embodiments, Multiple Transform Selection (MTS) (or DST-7 and/or DCT-8) is disabled for the current block when the current block is predicted using neighboring samples (or neighboring reconstructed samples) from non-zero reference lines. In some embodiments, the non-zero reference lines can include a reference line 1 and reference line 3. In some embodiments, the current block can be predicted using one or more neighboring samples from the reference line 1. In some embodiments the current block can be predicted using one or more neighboring samples from the reference line 3. In some embodiments, the current block can be predicted using neighboring samples from the reference line 1 and the reference line 3. In an embodiment, when transform skip mode is allowed, tu_mts_idx can be 0 or 1 for non-zero reference lines, and one bin can be signaled to indicate whether a transform skip (TS) mode is used or not. Table 6 illustrates exemplary values of the tu_mts_idx and corresponding transform modes.

TABLE 6 The values of the tu_mts_idx and corresponding transform modes transform type binarization tu_mts_idx horizontal vertical TS enabled TS disabled 0 SKIP SKIP 0 — 1 DCT-2 DCT-2 1 0

As shown in Table 6, when tu_mts_idx is equal to 0, the transform skip mode can be applied for both a horizontal transform and a vertical transform of transform blocks partitioned form the current block. When tu_mts_idx is equal to 1, a predetermined transform mode (e.g., DCT-2 transform mode (also referred to as DCT-2)) can be applied for both the horizontal transform and the vertical transform of the transform blocks. Still referring to Table 6, binarization values can be used to indicate whether the TS mode is enabled. For example, binarization 0 indicates that the TS mode is enabled in response to the tu_mts_idx being 0.

In an embodiment, a context used for entropy coding tu_mts_idx can depend on a reference line index. At the decoder side, the decoder can determine a context model from a set of context models according to a reference line associated with the reference line index, and the reference line includes at least one neighboring reconstructed sample of the current block. A value (e.g., 0 or 1) of the tu_mts_idx can be decoded, and a primary transform type (e.g., the transform skip mode or the DCT-2 transform mode) can be determined according to the value of the tu_mts_idx.

In an embodiment, when the transform skip mode is disabled, only a predetermined transform mode (e.g., the DCT-2 transform mode) can be applied (i.e., tu_mts_idx can only be 1) for non-zero reference lines.

In an embodiment, both the horizontal and/or vertical transform type can be set to DST-7 when the current block is predicted by the neighboring reconstructed samples from non-zero reference lines.

In an embodiment, the horizontal and/or vertical transform type can only be a predetermined transform mode (e.g., DCT-2 or DST-7) when the current block is predicted by the neighboring reconstructed samples from non-zero reference lines.

In an embodiment, the horizontal and/or vertical transform type is dependent on a width or a height of the current block when the current block is predicted by the neighboring reconstructed samples from non-zero reference lines. In an example, when the width (or the height) of the current block is equal to or larger than 4 pixels and equal to or less than 16 pixels, the horizontal (or vertical) transform type is set to a first transform mode (e.g., DST-7). Otherwise, the horizontal (or vertical) transform type is set to a second transform mode (e.g., DCT-2).

In an embodiment, different transform modes can be used for different non-zero reference lines. For example, a first transform mode (e.g. DST-7) can be only used for the reference line 1, and a second transform mode (e.g., DCT-2) can be only used for the reference line 3.

In some embodiments, TS (or transform skip) can be disabled for the current block when the current block is predicted using the neighboring samples from non-zero reference lines. In an example, only a predetermined transform mode (e.g., DCT-2) is applied when the current block is predicted using the neighboring samples from non-zero reference lines and the transform type (e.g., tu_mts_idx) is not signaled.

In some embodiments, LFNST can be disabled for the current block when the current block is predicted using the neighboring samples from non-zero reference lines. A context used for entropy coding a LFNST index can depend on a reference line index, where the LFNST index indicates whether the LFNST is performed on the transform blocks partitioned form the current block.

In some embodiments, if the current block is predicted using the neighboring reconstructed samples from non-zero reference lines, LFNST can be only applied when the width and/or the height of the current block satisfies a certain condition. For example, if the current block is predicted using the neighboring reconstructed samples from non-zero reference lines, LFNST is only applied when the width and/or the height of the current block is equal to or larger than a threshold value. The threshold value can be a positive integer, such as 8 pixels or 16 pixels.

FIG. 17 shows a flow chart outlining a process (1700) according to an embodiment of the disclosure. The process (1700) can be used in the reconstruction of a block, so to generate a prediction block for the block under reconstruction. In various embodiments, the process (1700) are executed by processing circuitry, such as the processing circuitry in the terminal devices (310), (320), (330) and (340), the processing circuitry that performs functions of the video encoder (403), the processing circuitry that performs functions of the video decoder (410), the processing circuitry that performs functions of the video decoder (510), the processing circuitry that performs functions of the video encoder (603), and the like. In some embodiments, the process (1700) is implemented in software instructions, thus when the processing circuitry executes the software instructions, the processing circuitry performs the process (1700). The process starts at (S1701) and proceeds to (S1710).

As show in FIG. 17, the process 1700 can start with (S1710), where coded information of a current block can be received from a coded video bitstream. The coded information includes prediction information of the current block.

At (S1720), a determination is made as to whether the current block is predicted using a neighboring reconstructed sample from a non-zero reference line based on the coded information. The non-zero reference line can be a reference line 1 or a reference line 3, for example.

At (S1730), a primary transform type can be determined based on the determination that the current block is predicted using the neighboring reconstructed sample from the non-zero reference line. The neighboring reconstructed sample can be one of a plurality of neighboring reconstructed samples used to predict the current block. Further, the plurality of neighboring reconstructed samples can be included in the same non-zero reference line or one or more different reference lines. In some embodiments, the primary transform type can be a DCT-2 mode or a skip mode. In some embodiments, the prediction information can include primary transform type information (e.g., tu_mts_idx). The primary transform type can be determined based on the primary transform type information. The primary transform type can be determined to be the skip mode, responsive to the primary transform type information indicating a first value, and the primary transform type can be determined to be the DCT-2 mode, responsive to the primary transform type information indicating a second value. In some embodiments, a context model can be determined from a set of context models based on the coded information, where the coded information indicates a reference line that includes the neighboring reconstructed sample. The primary transform type information can be decoded based on the determined context model, where the primary transform type information indicates whether the primary transform type is the skip mode or the DCT-2 mode.

At (S1740), a primary transform can be performed for a transform block that is partitioned from the current block in accordance with the determined primary transform type.

The embodiments described be rein can be used separately or combined in any order. Further, each of the embodiments, encoder, and decoder may be implemented by processing circuitry (e.g., one or more processors or one or more integrated circuits). In one example, the one or more processors execute a program that is stored in a non-transitory computer-readable medium.

The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. For example, FIG. 18 shows a computer system (1800) suitable for implementing certain embodiments of the disclosed subject matter.

The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by one or more computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like.

The components shown in FIG. 18 for computer system (1800) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system (1800).

Computer system (1800) may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

Input human interface devices may include one or more of (only one of each depicted): keyboard (1801), mouse (1802), trackpad (1803), touch screen (1810), data-glove (not shown), joystick (1805), microphone (1806), scanner (1807), camera (1808).

Computer system (1800) may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen (1810), data-glove (not shown), or joystick (1805), but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers (1809), be headphones (not depicted)), visual output devices (such as screens (1810) to include CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch-screen input capability, each with or without tactile feedback capability—some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted).

Computer system (1800) can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW (1820) with CD/DVD or the like media (1821), thumb-drive (1822), removable hard drive or solid state drive (1823), legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

Computer system (1800) can also include an interface to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses (1849) (such as, for example USB ports of the computer system (1800)); others are commonly integrated into the core of the computer system (1800) by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system (1800) can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices), or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above.

Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core (1840) of the computer system (1800).

The core (1840) can include one or more Central Processing Units (CPU) (1841), Graphics Processing Units (GPU) (1842), specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) (1843), hardware accelerators for certain tasks (1844), and so forth. These devices, along with Read-only memory (ROM) (1845), Random-access memory (1846), internal mass storage such as internal non-user accessible hard drives, SSDs, and the like (1847), may be connected through a system bus (1848). In some computer systems, the system bus (1848) can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core's system bus (1848), or through a peripheral bus (1849). Architectures for a peripheral bus include PCI, USB, and the like.

CPUs (1841), GPUs (1842), FPGAs (1843), and accelerators (1844) can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM (1845) or RAM (1846). Transitional data can be also be stored in RAM (1846), whereas permanent data can be stored for example, in the internal mass storage (1847). Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU (1841), GPU (1842), mass storage (1847), ROM (1845), RAM (1846), and the like.

The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system having architecture (1800), and specifically the core (1840) can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core (1840) that are of non-transitory nature, such as core-internal mass storage (1847) or ROM (1845). The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core (1840). A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core (1840) and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described be rein, including defining data structures stored in RAM (1846) and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator (1844)), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described be rein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software.

Appendix A: Acronyms

JEM: joint exploration model

VVC: versatile video coding

BMS: benchmark set

MV: Motion Vector

HEVC: High Efficiency Video Coding

SEI: Supplementary Enhancement Information

VUI: Video Usability Information

GOPs: Groups of Pictures

TUs: Transform Units,

PUs: Prediction Units

CTUs: Coding Tree Units

CTBs: Coding Tree Blocks

PBs: Prediction Blocks

HRD: Hypothetical Reference Decoder

SNR: Signal Noise Ratio

CPUs: Central Processing Units

GPUs: Graphics Processing Units

CRT: Cathode Ray Tube

LCD: Liquid-Crystal Di splay

OLED: Organic Light-Emitting Diode

CD: Compact Disc

DVD: Digital Video Disc

ROM: Read-Only Memory

RAM: Random Access Memory

ASIC: Application-Specific Integrated Circuit

PLD: Programmable Logic Device

LAN: Local Area Network

GSM: Global System for Mobile communications

LTE: Long-Term Evolution

CANBus: Controller Area Network Bus

USB: Universal Serial Bus

PCI: Peripheral Component Interconnect

FPGA: Field Programmable Gate Areas

SSD: solid-state drive

IC: Integrated Circuit

CU: Coding Unit

While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described be rein, embody the principles of the disclosure and are thus within the spirit and scope thereof. 

What is claimed is:
 1. A method of video decoding performed in a video decoder, the method comprising: receiving coded information of a current block from a coded video bitstream, the coded information comprising prediction information of the current block; determining whether the current block is predicted using a neighboring reconstructed sample from a non-zero reference line based on the coded information; determining a primary transform type according to a first transform scheme applied for non-zero reference lines based on a determination that the current block is predicted using the neighboring reconstructed sample from the non-zero reference line; determining the primary transform type according to a second transform scheme applied for a zero reference line based on a determination that the current block is predicted using the neighboring reconstructed sample from the zero reference line, the second transform scheme being different from the first transform scheme; and performing a primary transform for a transform block that is partitioned from the current block in accordance with the determined primary transform type, wherein: based on the current block being predicted using the neighboring reconstructed sample from the non-zero reference line, the non-zero reference line being a reference line 1 or a reference line 3, the primary transform type is a DST-7 mode, responsive to the non-zero reference line being the reference line 1, and the primary transform type is a DCT-2 mode, responsive to the non-zero reference line being the reference line
 3. 2. The method of claim 1, wherein: the current block is predicted using the neighboring reconstructed sample from the non-zero reference line, and the primary transform type according to the first transform scheme is the DCT-2 mode or a skip mode.
 3. The method of claim 2, wherein the prediction information includes primary transform type information, the determining the primary transform type includes determining the primary transform type based on the primary transform type information, the primary transform type is determined to be the skip mode, responsive to the primary transform type information indicating a first value, and the primary transform type is determined to be the DCT-2 mode, responsive to the primary transform type information indicating a second value.
 4. The method of claim 2, further comprising: determining a context model from a set of context models based on the coded information, the coded information indicating a reference line that includes the neighboring reconstructed sample; and decoding primary transform type information based on the determined context model, the primary transform type information indicating whether the primary transform type is the skip mode or the DCT-2 mode.
 5. The method of claim 1, wherein: the current block is predicted using the neighboring reconstructed sample from the non-zero reference line, and the primary transform type further comprises a horizontal transform type and a vertical transform type, the horizontal transform type being the DCT-2 mode or the DST-7 mode and the vertical transform type being the DCT-2 mode or the DST-7 mode.
 6. The method of claim 5, wherein the horizontal transform type and/or the vertical transform type are dependent on a width or a height of the current block.
 7. The method of claim 1, further comprising: receiving secondary transform information that indicates whether a secondary transformation is performed on the transform block; and performing the secondary transformation on the transform block, responsive to (i) the secondary transform information indicating that the secondary transformation is performed on the transform block, and (ii) the current block being predicted using a neighboring reconstructed sample from the zero reference line.
 8. The method of claim 1, further comprising: determining a context model from a set of context models based on the coded information, the coded information indicating a reference line that includes the neighboring reconstructed sample; decoding secondary transform information based on the determined context model, the secondary transform information indicating whether a secondary transformation is performed on the transform block; and performing the secondary transformation on the transform block responsive to the secondary transform information indicating the secondary transformation is performed on the transform block.
 9. The method of claim 1, further comprising: receiving secondary transform information, the secondary transform information indicating whether a secondary transformation is performed on the transform block; and performing the secondary transformation on the transform block, responsive to (i) the secondary transform information indicating that the secondary transformation is performed on the transform block, and (ii) the current block being predicted using the neighboring reconstructed sample from the non-zero reference line, and (iii) a width and/or a height of the current block is equal to or larger than a threshold.
 10. An apparatus for video decoding, comprising: processing circuitry configured to: receive coded information of a current block from a coded video bitstream, the coded information comprising prediction information of the current block; determine whether the current block is predicted using a neighboring reconstructed sample from a non-zero reference line based on the coded information; determine a primary transform type according to a first transform scheme applied for non-zero reference lines based on a determination that the current block is predicted using neighboring reconstructed sample from the non-zero reference line; determine the primary transform type according to a second transform scheme applied for a zero reference line based on a determination that the current block is predicted using the neighboring reconstructed sample from the zero reference line, the second transform scheme being different from the first transform scheme; and perform a primary transform for a transform block that is partitioned from the current block in accordance with the determined primary transform type, wherein: based on the current block being predicted using the neighboring reconstructed sample from the non-zero reference line, the non-zero reference line being a reference line 1 or a reference line 3, the primary transform type is a DST-7 mode, responsive to the non-zero reference line being the reference line 1, and the primary transform type is a DCT-2 mode, responsive to the non-zero reference line being the reference line
 3. 11. The apparatus of claim 10, wherein: the current block is predicted using the neighboring reconstructed sample from the non-zero reference line, and the primary transform type according to the first transform scheme is the DCT-2 mode or a skip mode.
 12. The apparatus of claim 11, wherein: the prediction information includes primary transform type information, the primary transform type is determined based on the primary transform type information, the primary transform type is determined to be the skip mode, responsive to the primary transform type information indicating a first value, and the primary transform type is determined to be the DCT-2 mode, responsive to the primary transform type information indicating a second value.
 13. The apparatus of claim 11, wherein the processing circuitry is further configured to: determine a context model from a set of context models based on the coded information, the coded information indicating a reference line that includes the neighboring reconstructed sample; and decode primary transform type information based on the determined context model, the primary transform type information indicating whether the primary transform type is the skip mode or the DCT-2 mode.
 14. The apparatus of claim 10, wherein: the current block is predicted using the neighboring reconstructed sample from the non-zero reference line, and the primary transform type further comprises a horizontal transform type and a vertical transform type, the horizontal transform type being the DCT-2 mode or the DST-7 mode and the vertical transform type being the DCT-2 mode or the DST-7 mode.
 15. The apparatus of claim 14, wherein the horizontal transform type and/or the vertical transform type are dependent on a width or a height of the current block.
 16. The apparatus of claim 10, the processing circuitry is further configured to: receive secondary transform information that indicates whether a secondary transformation is performed on the transform block; and perform the secondary transformation on the transform block, responsive to (i) the secondary transform information indicating that the secondary transformation is performed on the transform block, and (ii) the current block being predicted using a neighboring reconstructed sample from the zero reference line.
 17. The apparatus of claim 10, wherein the processing circuitry is further configured to: determine a context model from a set of context models based on the coded information, the coded information indicating a reference line that includes the neighboring reconstructed sample; decode secondary transform information based on the determined context model, the secondary transform information indicating whether a secondary transformation is performed on the transform block; and perform the secondary transformation on the transform block responsive to the secondary transform information indicating the secondary transformation is performed on the transform block.
 18. A non-transitory computer-readable medium storing instructions which when executed by a computer for video decoding cause the computer to perform: receiving coded information of a current block from a coded video bitstream, the coded information comprising prediction information of the current block; determining whether the current block is predicted using a neighboring reconstructed sample from a non-zero reference line based on the coded information; determining a primary transform type according to a first transform scheme applied for non-zero reference lines based on a determination that the current block is predicted using the neighboring reconstructed sample from the non-zero reference line; determining the primary transform type according to a second transform scheme applied for a zero reference line based on a determination that the current block is predicted using the neighboring reconstructed sample from the zero reference line, the second transform scheme being different from the first transform scheme; and performing a primary transform for a transform block that is partitioned from the current block in accordance with the determined primary transform type, wherein: based on the current block being predicted using the neighboring reconstructed sample from the non-zero reference line, the non-zero reference line being a reference line 1 or a reference line 3, the primary transform type is a DST-7 mode, responsive to the non-zero reference line being the reference line 1, and the primary transform type is a DCT-2 mode, responsive to the non-zero reference line being the reference line
 3. 